SIAM J. DISCRETE MATH. Vol. 23, No. 4, pp. 1800–1813 c 2009 Society for Industrial and Applied Mathematics 

Source URL: community.dur.ac.uk

• NP-complete problems
• Trapezoid graph
• Graph coloring
• Independent set
• Intersection graph
• Interval graph
• Clique
• Perfect graph
• Pathwidth
• Planar graph

MIMS Technical Report No) Proceedings of Symposia in Pure Mathematics Discrete Geometric Analysis Toshikazu Sunada

Source URL: www.mims.meiji.ac.jp

• Graph theory
• Harmonic functions
• Fourier analysis
• Laplace operator
• Multivariable calculus
• Covering graph
• Graph
• Logarithm
• Discrete Laplace operator
• Differential forms on a Riemann surface

COURSE SYLLABUS Southern Illinois University CS 215: Discrete Mathematics - Spring 2016 Contact Information: Instructor: Shiva Houshmand

Source URL: www.cs.siu.edu

• Education reform
• Home
• Homework
• Standards-based education
• Course
• Southern Illinois University Carbondale
• Educational technology

Return times and synchronous recurrence Piotr Oprocha Faculty of Applied Mathematics, AGH University of Science and Technology, Krakow, Poland Let (X, f ) be a discrete dynamical system and let F be a hereditary upward s

Source URL: irafm.osu.cz

CEOC Centro de Estudos em Optimização e Controlo (Centre for Research in Optimization and Control) Optimization, Graph Theory and Combinatorics

Source URL: ceoc.mat.ua.pt

• Operations research
• Mathematical optimization
• Graph theory
• Combinatorics
• Random graph
• Linear programming
• Discrete mathematics
• Book:Graph Theory
• Planar graph

1 Documenta Math. Preface

Source URL: documenta.sagemath.org

• Operations research
• Fellows of the Royal Society
• Computational geometry
• Diagrams
• Discrete geometry
• Voronoi diagram
• Mathematical optimization
• Carl Friedrich Gauss
• Matroid
• Documenta
• Mathematics
• Philosophy of mathematics

Curriculum Vitae Carl Feghali Contact information School of Engineering and Computing Sciences, Durham University, Durham, United Kingdom

Source URL: community.dur.ac.uk

• Discrete mathematics
• Clique
• Graph theory
• Algorithmica
• Theoretical computer science

The Skolemization of existential quantifiers in intuitionistic logic Matthias Baaz and Rosalie Iemhoff∗ Institute for Discrete Mathematics and Geometry E104, Technical University Vienna, Wiedner Hauptstrasse 8-10, 1040

Source URL: www.phil.uu.nl

DISCRETE APPLIED MATHEMATICS ELSEYIER Discrete Applied

Source URL: www.maths.lse.ac.uk

• Graph theory
• Mathematics
• NP-complete problems
• NP-hard problems
• Graph coloring
• Routing algorithms
• Search algorithms
• Hamiltonian path
• Bipartite graph
• Travelling salesman problem
• A* search algorithm
• Planar separator theorem

2009 Paper 1 Question 4 Discrete Mathematics I (a) Define what it means for a relation R ⊆ A × A to be: (i ) irreflexive

Source URL: www.cl.cam.ac.uk